Definition (submodular utility function)

Say utility function uu is submodular if for all α,β∈{0,1,∗}n\alpha, \beta \in \{0,1,*\}^n, if α\alpha is an extension to β\beta and αi=βi=∗\alpha_i = \beta_i = * then

u(αi←0)−u(α)≤u(βi←0)−u(β)u(αi←1)−u(α)≤u(βi←1)−u(β) \begin{aligned} u(\alpha_{i \gets 0}) - u(\alpha) \leq u(\beta_{i \gets 0}) - u(\beta) \\ u(\alpha_{i \gets 1}) - u(\alpha) \leq u(\beta_{i \gets 1}) - u(\beta) \end{aligned}

where e.g. αi←1\alpha_{i \gets 1} is the partial assignment derived from α\alpha by setting αi=1\alpha_i = 1.

(α\alpha, β\beta are realizations)

(can also formulate in terms of X⊆YX \subseteq Y)

Definition (submodular set function)

A set function f:2V→ℝf: 2^V \to \mathbb{R}, for X,Y⊆VX, Y \subseteq V, is called submodular if

f(X)+f(Y)≥f(X∪Y)+f(X∩Y)f(X) + f(Y) \geq f(X \cup Y) + f(X \cap Y)

See also


References

  1. https://en.wikipedia.org/wiki/Submodular_set_function
  2. K. Murota, “Convexity and Steinitz’s Exchange Property,” Advances in Mathematics, vol. 124, no. 2, pp. 272–310, Dec. 1996, doi: 10.1006/aima.1996.0084.
  3. https://theory.stanford.edu/~jvondrak/MATH233B-2017/lec14.pdf